Mathematics of Computation
نویسندگان
چکیده
For each prime p, let p# be the product of the primes less than or equal to p. We have greatly extended the range for which the primality of n!± 1 and p#± 1 are known and have found two new primes of the first form (6380! + 1, 6917!− 1) and one of the second (42209# + 1). We supply heuristic estimates on the expected number of such primes and compare these estimates to the number actually found.
منابع مشابه
The Principle of Relativity: From Ungar’s Gyrolanguage for Physics to Weaving Computation in Mathematics
This paper extends the scope of algebraic computation based on a non standard $times$ to the more basic case of a non standard $+$, where standard means associative and commutative. Two physically meaningful examples of a non standard $+$ are provided by the observation of motion in Special Relativity, from either outside (3D) or inside (2D or more), We revisit the ``gyro''-theory ...
متن کاملSymbolic computation of the Duggal transform
Following the results of cite{Med}, regarding the Aluthge transform of polynomial matrices, the symbolic computation of the Duggal transform of a polynomial matrix $A$ is developed in this paper, using the polar decomposition and the singular value decomposition of $A$. Thereat, the polynomial singular value decomposition method is utilized, which is an iterative algorithm with numerical charac...
متن کاملComputation of Minimum Hamming Weight for Linear Codes
In this paper, we consider the minimum Hamming weight for linear codes over special finite quasi-Frobenius rings. Furthermore, we obtain minimal free $R$-submodules of a finite quasi-Frobenius ring $R$ which contain a linear code and derive the relation between their minimum Hamming weights. Finally, we suggest an algorithm that computes this weight using the Grobner basis and we show that und...
متن کاملComputation on Zagreb Polynomial of Some Families of Dendrimers
In mathematical chemistry, a particular attention is given to degree-based graph invariant. The Zagrebpolynomial is one of the degree based polynomials considered in chemical graph theory. A dendrimer isan artificially manufactured or synthesized molecule built up from branched units called monomers. Inthis note, the first, second and third Zagreb poly...
متن کاملComputation of the linear Schrodinger Energy levels by Sinc method
Computation of the Schrodinger equation energy levels is very important in physics. For example we can use these levels to calculate the absorption coefficient and light refraction in a material as well as calculation of the interband and intersubband transition energies. Density of states of the system can also be obtained by using the energy levels. Thereafter we can determine that the system...
متن کاملComputation of the q-th roots of circulant matrices
In this paper, we investigate the reduced form of circulant matrices and we show that the problem of computing the q-th roots of a nonsingular circulant matrix A can be reduced to that of computing the q-th roots of two half size matrices B - C and B + C.
متن کامل